Surpassing the information theoretic bound with fusion trees
نویسندگان
چکیده
منابع مشابه
Information Theoretic Divergences With Application To Information Fusion
Many modern day collaborative systems / system of systems (SoS) rely heavily on the sharing of information in order to improve performance, manage resources, and maximize overall capability. These types of systems are characterized by many decentralized nodes which can either all be identical or are divided into a finite set of specialized types. When information is shared within any SoS, the o...
متن کاملInformation Theoretic Clustering Using Minimum Spanning Trees
In this work we propose a new information-theoretic clustering algorithm that infers cluster memberships by direct optimization of a non-parametric mutual information estimate between data distribution and cluster assignment. Although the optimization objective has a solid theoretical foundation it is hard to optimize. We propose an approximate optimization formulation that leads to an efficien...
متن کاملCue Fusion using Information Theoretic Learning
In order to segment independently moving objects (IMO) in a visual scene, neurons in the higher processing stages of the visual cortex are able to fuse visual attributes (cue fusion). The modeling of cue fusion is the objective of the predoctoral project and will be developed in the context of Information Theoretic Learning.
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملAdaptive Sorting and the Information Theoretic Lower Bound
We derive a variation of insertion sort that is near optimal with respect to the number of inversions present in the input. The number of comparisons performed by our algorithms, on an input sequence of length n that has I inversions, is at most n log2 ( I n + 1)+O(n). Moreover, we give an implementation of the algorithm that runs in time O(n log2 ( I n + 1) + n). All previously known algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1993
ISSN: 0022-0000
DOI: 10.1016/0022-0000(93)90040-4